J ul 2 00 8 ULD - Lattices and ∆ - Bonds

ULD-Lattices and ∆-Bonds

We provide a characterization of upper locally distributive lattices (ULD-lattices) in terms of edge colorings of their cover graphs. In many instances where a set of combinatorial objects carries the order structure of a lattice this characterization yields a slick proof of distributivity or UL-distributivity. This is exemplified by proving a distributive lattice structure on ∆-bonds with inva...

Distributive Lattices from Graphs

Several instances of distributive lattices on graph structures are known. This includes c-orientations (Propp), α-orientations of planar graphs (Felsner/de Mendez) planar flows (Khuller, Naor and Klein) as well as some more special instances, e.g., spanning trees of a planar graph, matchings of planar bipartite graphs and Schnyder woods. We provide a characterization of upper locally distributi...

Characterization of Lattices Induced by (extended) Chip Firing Games

The Chip Firing Game (CFG) is a discrete dynamical model used in physics, computer science and economics. It is known that the set of configurations reachable from an initial configuration (this set is called the configuration space) can be ordered as a lattice. We first present a structural result about this model, which allows us to introduce some useful tools for describing those lattices. T...

ar X iv : 0 80 7 . 00 58 v 1 [ m at h . D G ] 1 J ul 2 00 8 EQUIVARIANT DIFFERENTIAL CHARACTERS AND SYMPLECTIC REDUCTION

We describe equivariant differential characters (classifying equi-variant circle bundles with connections), their prequantization, and reduction.

ua nt - p h / 04 07 06 4 v 1 8 J ul 2 00 4 Basics of Quantum Computation ( Part 1 )